Minimum matrix representation of some key system
نویسندگان
چکیده
منابع مشابه
Minimum matrix representation of closure operations
Let (I be a column of the fft x /I matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy IO see that if Y,~,(A) denotes . the columns implied by A, than :/,,,(A) is a closure operation. We say that M represents this closure operation. s(:/ ) is the minimum number of the rows of the matrices representing a given closure ...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملSome Key Techniques in Active Information System
Active Information System (AIS) can describe the function specifications in the application environment more availably and make the reaction actively for the different events in the application environment. We propose the solution to realize AIS in the Event Definition and Processing, Definition and Processing of ECA Rule and Realization Strategy. With DSSPCF the design methods are a very effec...
متن کاملKey Distribution System for MANET with Minimum Prior Trust Relationship
As various applications of wireless ad hoc network have been proposed, security has become one of the big research challenges and is receiving increasing attention. In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node m...
متن کاملAdmissible Vectors of a Covariant Representation of a Dynamical System
In this paper, we introduce admissible vectors of covariant representations of a dynamical system which are extensions of the usual ones, and compare them with each other. Also, we give some sufficient conditions for a vector to be admissible vector of a covariant pair of a dynamical system. In addition, we show the existence of Parseval frames for some special subspaces of $L^2(G)$ related to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00200-1